Dense $H$-Free Graphs are Almost $(\chi(H)-1)$-Partite
نویسندگان
چکیده
منابع مشابه
Dense H-Free Graphs are Almost (χ(H)-1)-Partite
By using the Szemerédi Regularity Lemma [10], Alon and Sudakov [1] recently extended the classical Andrásfai-Erdős-Sós theorem [2] to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true. Given any (r+1)-partite graph H whose smallest part has t vertices, there exists a constant C such that for any given ε > 0 and sufficiently large n...
متن کاملInduced Complete h-partite Graphs in Dense Clique-less Graphs
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h−1 h n, which contains no copy of Kb (the complete graph with b vertices), contains at least (1 − o(1)) n ha vertex disjoint induced copies of the complete h-partite graph with a vertices in each color class. Mathematics subject classification numbers: 05C70, 05C55. All graphs considered here are ...
متن کاملOn the non-(p-1)-partite Kp-free graphs
We say that a graph G is maximal Kp-free if G does not contain Kp but if we add any new edge e ∈ E(G) to G, then the graph G+ e contains Kp. We study the minimum and maximum size of non-(p − 1)-partite maximal Kp-free graphs with n vertices. We also answer the interpolation question: Unauthenticated Download Date | 2/2/17 7:37 PM 10 K. Amin, J. Faudree, R.J. Gould and E. Sidorowicz for which va...
متن کاملA limit law of almost l-partite graphs
For integers l ≥ 1, d ≥ 0 we study (undirected) graphs with vertices 1, . . . , n such that the vertices can be partitioned into l parts such that every vertex has at most d neighbours in its own part. The set of all such graphs is denoted Pn(l, d). We prove a labelled rst-order limit law, i.e., for every rst-order sentence φ, the proportion of graphs in Pn(l, d) that satisfy φ converges as n→∞...
متن کاملAlmost all H-free graphs have the Erdős-Hajnal property
Erdős and Hajnal conjectured that, for every graph H, there exists a constant (H) > 0 such that every H-free graph G (that is, not containing H as an induced subgraph) must contain a clique or an independent set of size at least |G| . We prove that there exists (H) such that almost every H-free graph G has this property, meaning that, amongst the H-free graphs with n vertices, the proportion ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/293